def solve():
n = int(input())
numbers = sorted(map(int, input().split()))
total = sum(numbers) // n
for i in range(n):
print(numbers[i], total - numbers[i])
solve()
#include <bits/stdc++.h>
#include <set>
#include <string>
using namespace std;
int main(){
int t;
cin>>t;
int arr[2*t];
for(int i=0;i<2*t;i++){cin>>arr[i];}
for(int i=1;i<2*t;i++){
int curr = arr[i];
int j = i-1;
while(arr[j]>curr && j>=0){arr[j+1]=arr[j];j--;}
arr[j+1]=curr;
}
for(int i=0;i<t;i++){
cout<<arr[i]<<" "<<arr[2*t-i-1]<<"\n";
}
}1553D - Backspace | 1670D - Very Suspicious |
1141B - Maximal Continuous Rest | 1341A - Nastya and Rice |
1133A - Middle of the Contest | 385A - Bear and Raspberry |
1311B - WeirdSort | 1713F - Lost Array |
236B - Easy Number Challenge | 275A - Lights Out |
147A - Punctuation | 253A - Boys and Girls |
1327E - Count The Blocks | 984A - Game |
12B - Correct Solution | 1355B - Young Explorers |
485A - Factory | 628A - Tennis Tournament |
1436B - Prime Square | 1707B - Difference Array |
1422C - Bargain | 1611F - ATM and Students |
660A - Co-prime Array | 1692F - 3SUM |
1470A - Strange Birthday Party | 190D - Non-Secret Cypher |
1721B - Deadly Laser | 1721C - Min-Max Array Transformation |
1721A - Image | 1180C - Valeriy and Deque |